Distributed medium access control with conditionally altruistic users
نویسندگان
چکیده
منابع مشابه
Distributed medium access control with conditionally altruistic users
In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming ‘by rule’ conformance to a protocol designed to regulate packet-flow rates (e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic, conditional, altruism term into the net utility. The effects ...
متن کاملDistributed Medium Access Control with Dynamic Altruism
In this paper, we consider medium access control of local area networks (LANs) under limited-information conditions as befits a distributed system. Rather than assuming “by rule” conformance to a protocol designed to regulate packet-flow rates (as in, e.g., CSMA windowing), we begin with a non-cooperative game framework and build a dynamic altruism term into the net utility. Our objective is to...
متن کاملInterference Estimation In Randomly Distributed Systems with Medium Access Control
In this paper we will discuss methods for interference estimation applicable to wireless, randomly distributed and uncoordinated networks. Primarily, the application range of such networks was mainly military [3], but nowadays there is also a growing interest on civil applications like environmental monitoring or short-range communication purposes. We assume randomly distributed network element...
متن کاملDistributed Medium Access Control with SDMA Support for WLANs
SUMMARY With simultaneous multiuser transmissions, spatial division multiple access (SDMA) provides substantial throughput gain over the single user transmission. However, its implementation in WLANs with contention-based IEEE 802.11 MAC remains challenging. Problems such as coordinating and synchronizing the multiple users need to be solved in a distributed way. In this paper, we propose a dis...
متن کاملEfficient Distributed Medium Access
Consider a wireless network of n nodes represented by a graph G = (V,E) where anedge (i, j) ∈ E models the fact that transmissions of i and j interfere with each other, i.e.simultaneous transmissions of i and j become unsuccessful. Hence it is required that ateach time instance a set of non-interfering nodes (corresponding to an independent set in G)access the wireless mediu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking
سال: 2013
ISSN: 1687-1499
DOI: 10.1186/1687-1499-2013-202